On a Markovian Process AlgebraPeter

Process algebras extended by a concept to present timing behaviour have been very recently proposed as a good modelling tool for the combined analysis of qualitative and quantitative system behaviour. We introduce a a process algebra including exponentially distributed time delays and a systematic approach to compute the underlying labelled transition system and continuous time Markov process. In particular it can be shown that the compositional operations on the level of the algebra can be directly translated in composi-tional operations to build the state space and generator matrix of the underlying Markov process. In the approach it is possible to deene and prove very naturally equivalence relations covering quantitative aspects which are congruence relations according to composition operators.